- ambiguous grammar
- неоднозначная грамматика
English-Russian dictionary of computer science and programming. 2013.
ambiguous grammar
Смотреть что такое "ambiguous grammar" в других словарях:
Ambiguous grammar — In computer science, a grammar is said to be an ambiguous grammar if there is some string that it can generate in more than one way (i.e., the string has more than one parse tree or more than one leftmost derivation). A language is inherently… … Wikipedia
Grammar — is the field of linguistics that covers the rules governing the use of any given natural language. It includes morphology and syntax, often complemented by phonetics, phonology, semantics, and pragmatics. Each language has its own distinct… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… … Wikipedia
Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… … Wikipedia
HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… … Encyclopedia of Judaism
Parsing expression grammar — A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language. A parsing expression grammar essentially represents a recursive… … Wikipedia
Hungarian grammar — Hungarian language Closeup view of a Hungarian keybo … Wikipedia
Esperanto grammar — Esperanto is a constructed auxiliary language. A highly regular grammar makes Esperanto much easier to learn than most other languages of the world, though particular features may be more or less advantageous or difficult depending on the… … Wikipedia
Japanese grammar — The Japanese language has a highly regular agglutinative verb morphology, with both productive and fixed elements. Typologically, its most prominent feature is topic creation: Japanese has prominent topics (although it is possible for topics and… … Wikipedia
All Saints Greek Orthodox Grammar School — Infobox Aust school private name = All Saints Greek Orthodox Grammar School motto = ΣΤΩΜΕΝ ΚΑΛΩΣ Let us stand well established = 1990 type = Independent, Co educational, Day school denomination = Christian Orthodox slogan = key people = Mr.… … Wikipedia
